Transmission network expansion planning based on hybridization model of neural networks and harmony search algorithm

نویسندگان

  • Mohammad Taghi Ameli
  • Mojtaba Shivaie
  • Saeid Moslehpour
چکیده

Article history: Received 1 August 2011 Available online 10 August 2011 Transmission Network Expansion Planning (TNEP) is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimization problem in which the expansion purposes are optimized. Artificial Intelligence (AI) tools such as Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TS) and Artificial Neural Networks (ANNs) are methods used for solving the TNEP problem. Today, by using the hybridization models of AI tools, we can solve the TNEP problem for large-scale systems, which shows the effectiveness of utilizing such models. In this paper, a new approach to the hybridization model of Probabilistic Neural Networks (PNNs) and Harmony Search Algorithm (HSA) was used to solve the TNEP problem. Finally, by considering the uncertain role of the load based on a scenario technique, this proposed model was tested on the Garver’s 6-bus network. © 2012 Growing Science Ltd. All rights reserved

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transmission Network Expansion Planning Based on Hybridization Model of Probabilistic Neural Networks and Harmony Search Algorithm

Transmission network expansion planning (TNEP) is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimizing problem in which the expansion purposes are optimized. The Artificial Intelligence (AI) tools such as Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TS), Artificial n...

متن کامل

P/E Modeling and Prediction of Firms Listed on the Tehran Stock Exchange; a New Approach to Harmony Search Algorithm and Neural Network Hybridization

Investors and other contributors to stock exchange need a variety of tools, measures, and information in order to make decisions. One of the most common tools and criteria of decision makers is price-to earnings per share ratio. As a result, investors are in pursuit of ways to have a better assessment and forecast of price and dividends and get the highest returns on their investment. Previous ...

متن کامل

Structural Reliability: An Assessment Using a New and Efficient Two-Phase Method Based on Artificial Neural Network and a Harmony Search Algorithm

In this research, a two-phase algorithm based on the artificial neural network (ANN) and a harmony search (HS) algorithm has been developed with the aim of assessing the reliability of structures with implicit limit state functions. The proposed method involves the generation of datasets to be used specifically for training by Finite Element analysis, to establish an ANN model using a proven AN...

متن کامل

Sub-transmission sub-station expansion planning based on bacterial foraging optimization algorithm

In recent years, significant research efforts have been devoted to the optimal planning of power systems. Substation Expansion Planning (SEP) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future load demand. The large number of design variables and combination of discr...

متن کامل

پیش‌بینی شاخص سهام با استفاده از ترکیب شبکه عصبی مصنوعی و مدل‌های فرا ابتکاری جستجوی هارمونی و الگوریتم ژنتیک

هدف پژوهش حاضر پیش‌بینی شاخص قیمت بورس اوراق بهادار تهران با استفاده از مدل شبکه عصبی هیبریدی مبتنی بر الگوریتم ژنتیک و جستجوی هارمونی است. مربوط‌ترین نماگرهای تکنیکی به عنوان متغیرهای ورودی و تعداد بهینه نرون در لایه پنهان شبکه عصبی مصنوعی با استفاده از الگوریتم‌های فراابتکاری ژنتیک و جستجوی هارمونی حاصل می‌گردد. مقادیر روزانه شاخص قیمت بورس اوراق بهادار تهران از تاریخ 1/10/91 الی 30/9/94 جهت ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011